Necessity of Adaptive Receiver Realizations
نویسندگان
چکیده
منابع مشابه
Adaptive Beamforming Assisted Receiver
Adaptive beamforming is capable of separating user signals transmitted on the same carrier frequency, and thus provides a practical means of supporting multiusers in a space-division multipleaccess scenario. Moreover, for the sake of further improving the achievable bandwidth efficiency, highthroughput quadrature amplitude modulation (QAM) schemes have becomes popular in numerous wireless netwo...
متن کاملImplementation of an adaptive burst DQPSK receiver over shallow water acoustic channel
In an environment such as underwater channel where placing test equipments are difficult to handle, it is much practical to have hardware simulators to examine suitably designed transceivers (transmitter/receiver). The simulators of this kind will then allow researchers to observe their intentions and carry out repetitive tests to find suitable digital coding/decoding algorithms. In this p...
متن کاملSpoofing Mitigation of GPS Receiver using Least Mean Squares-Based Adaptive Filter
The Global Positioning System (GPS) signals are very weak signal over wireless channels, so they are vulnerable to in-band interferences. Therefore, even a low-power interference can easily spoof GPS receivers. Among the variety of GPS signal interference, spoofing is considered as the most dangerous intentional interference. The spoofing effects can mitigate with an appropriate strategy in the...
متن کاملFrequency-domain realizations of adaptive parallel-cascade quadratic filters
Parallel-cascade realizations of truncated Volterra systems implement higher-order systems using a parallel connection of multiplicative combinations of lower-order systems. Such realizations are modular and permit efficient approximations of truncated Volterra systems. Frequency-domain realizations of the leastmean-square (LMS) adaptive filter and the normalized LMS adaptive filter that implem...
متن کاملTwo Constant-Factor-Optimal Realizations of Adaptive Heapsort
In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min O(lgn) worstcase time including at most lgn+O(1) element comparisons, where n is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Acoustical Society of America
سال: 1964
ISSN: 0001-4966
DOI: 10.1121/1.1939358